A Study of Clustering Algorithms and Validity for Lossy Image Set Compression
نویسندگان
چکیده
A hierarchical lossy image set compression algorithm (HMSTa) has recently been proposed for lossy compression of image sets. It was shown that this algorithm performs well when an image set contains well separated clusters of similar images. As a result, if one applies the HMSTa algorithm after a clustering algorithm has been applied, the compression performance depends on the quality of the partition. In this paper, we examine a number of well-known hierarchical clustering methods and cluster validity measures, and their relationships to the compression performance of HMSTa. This relationship can be used as a component in a fully automated image set compression algorithm. We also briefly examine the merit of using different compression schemes depending on the compactness of the cluster in order to reduce computational complexity.
منابع مشابه
فشردهسازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر
Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...
متن کاملFuzzy Clustering and Hyperanalytic Wavelet Transform for Lossy Image Compression: A Review
Clustering techniques are mostly unsupervised methods that can be used to organize data into groups based on similarities among the individual data items. Most clustering algorithms do not rely on assumptions common to conventional statistical methods, such as the underlying statistical distribution of data, and therefore they are useful in situations where little prior knowledge exists. The po...
متن کاملON A LOSSY IMAGE COMPRESSION/RECONSTRUCTION METHOD BASED ON FUZZY RELATIONAL EQUATIONS
The pioneer work of image compression/reconstruction based onfuzzy relational equations (ICF) and the related works are introduced. TheICF regards an original image as a fuzzy relation by embedding the brightnesslevel into [0,1]. The compression/reconstruction of ICF correspond to thecomposition/solving inverse problem formulated on fuzzy relational equations.Optimizations of ICF can be consequ...
متن کاملHierarchical Minimum Spanning Trees for Lossy Image Set Compression
A number of minimum spanning tree algorithms have been proposed for lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and possibly an average image, and a minimum spanning tree is used to determine which difference images to encode. In this paper, we propose a hierarchical minimum spanning tree algorithm in which the minimum spanning...
متن کاملSubspaces Clustering Approach to Lossy Image Compression
In this contribution lossy image compression based on subspaces clustering is considered. Given a PCA factorization of each cluster into subspaces and a maximal compression error, we show that the selection of those subspaces that provide the optimal lossy image compression is equivalent to the 0-1 Knapsack Problem. We present a theoretical and an experimental comparison between accurate and ap...
متن کامل